Splitting Answer Set Programs with Respect to Intensionality Statements
نویسندگان
چکیده
Splitting a logic program allows us to reduce the task of computing its stable models similar tasks for subprograms. This can be used increase solving performance and prove correctness programs. We generalize conditions under which this technique is applicable, by considering not only dependencies between predicates but also their arguments context. splitting programs commonly in practice previous results were applicable.
منابع مشابه
Rewriting Optimization Statements in Answer-Set Programs
Constraints on Pseudo-Boolean (PB) expressions can be translated into Conjunctive Normal Form (CNF) using several known translations. In Answer-Set Programming (ASP), analogous expressions appear in weight rules and optimization statements. Previously, we have translated weight rules into normal rules, using normalizations designed in accord with existing CNF encodings. In this work, we rededic...
متن کاملCommunicating Answer Set Programs
Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for representing and reasoning with the combined answer set programs of multiple agents have already been proposed, the actual gain in expressivity when adding communication has not been thoroughly studied. We show that allowing ...
متن کاملBidirectional Answer Set Programs with Function Symbols
Current Answer Set Programming (ASP) solvers largely build on logic programming without function symbols. This limitation makes ASP decidable, but greatly complicates the modeling of indefinite time, recursive data structures (e.g., lists), and infinite processes and objects in general. Recent research thus aims at finding decidable fragments of ASPwith function symbols and studying their compl...
متن کاملAnswer Set Programs with Queries over Subprograms
Answer-Set Programming (ASP) is a declarative programming paradigm. In this paper we discuss two related restrictions and present a novel modeling technique to overcome them: (1) Meta-reasoning about the collection of answer sets of a program is in general only possible by external postprocessing, but not within the program. This prohibits the direct continuation of reasoning based on the answe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i5.25780